Information theoretic parameters of noncommutative graphs and convex corners

We establish a second anti-blocker theorem for noncommutative convex corners, show that the anti-blocking operation is continuous on bounded sets of and define optimization parameters given corner generalize well-known graph theoretic quantities. entropy state with respect to corner, characterize its maximum value in terms generalized fractional chromatic number splitting results demonstrate entropic complementarity between anti-blocker. identify two extremal tensor products corners examine behavior introduced tensoring. Specializing graphs, we obtain quantum versions clique covering number, as well notion state, which be graph. Witsenhausen rate compute values our some specific cases.